Turing Incomparability in Scott Sets

نویسندگان

  • ANTONÍN KUČERA
  • THEODORE A. SLAMAN
  • Scott
چکیده

For every Scott set F and every nonrecursive set X in F , there is a Y ∈ F such that X and Y are Turing incomparable.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SPOT PATTERNS IN GRAY SCOTT MODEL WITH APPLICATION TO EPIDEMIC CONTROL

In this work, we analyse a pair of two-dimensional coupled reaction-diusion equations known as the Gray-Scott model, in which spot patterns have been observed. We focus on stationary patterns, and begin by deriving the asymptotic scaling of the parameters and variables necessary for the analysis of these patterns. A complete bifurcation study of these solutions is presented. The main mathematic...

متن کامل

A measure-theoretic proof of Turing incomparability

We prove that if S is an ω-model of weak weak König’s lemma and A ∈ S, A ⊆ ω, is incomputable, then there exists B ∈ S, B ⊆ ω, such that A and B are Turing incomparable. This extends a recent result of Kučera and Slaman who proved that if S0 is a Scott set (i.e. an ω-model of weak König’s lemma) and A ∈ S0, A ⊆ ω, is incomputable, then there exists B ∈ S0, B ⊆ ω, such that A and B are Turing in...

متن کامل

A kind of fuzzy upper topology on L-preordered sets

Considering a commutative unital quantale L as the truth value table and using the tool of L-generalized convergence structures of stratified L-filters, this paper introduces a kind of fuzzy upper topology, called fuzzy S-upper topology, on L-preordered sets. It is shown that every fuzzy join-preserving L-subset is open in this topology. When L is a complete Heyting algebra, for every completel...

متن کامل

Limit Computability and Ultrafilters

We study a class of operators on Turing degrees arising naturally from ultrafilters. Suppose U is a nonprincipal ultrafilter on ω. We can then view a sequence of sets A = (Ai)i∈ω as an “approximation” of a set B produced by taking the limits of the Ai via U : we set limU (A) = {x : {i : x ∈ Ai} ∈ U}. This can be extended to the Turing degrees, by defining δU (a) = {limU (A) : A = (Ai)i∈ω ∈ a}. ...

متن کامل

Munich Personal RePEc Archive

Since it has been shown that completeness and constructiveness is an unattainable goal for paretian and anonymous social welfare relations on infinite utility streams, recent contributions generally propose criteria displaying some incomparability. I suggest an interpretation of incomparability which sets a limit to the recourse to the judgment of incomparability when certain intergenerational ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006